ON OPTIMAL PATTERN FLOWS

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Pattern Matching on Meshes

Parallel pattern matching on a mesh-connected array of processors is considered. The problem is to nd all occurrences of a pattern in a text. The input text is a string of n symbols placed in a p n p n mesh, each processor storing one symbol. The pattern is stored similarly in a contiguous portion of the mesh. An algorithm solving the problem in time O(p n) is presented. It applies a novel tech...

متن کامل

Finding Optimal Flows Efficiently

Among the models of quantum computation, the One-way Quantum Computer [10, 11] is one of the most promising proposals of physical realization [12], and opens new perspectives for parallelization by taking advantage of quantum entanglement [2]. Since a one-way quantum computation is based on quantum measurement, which is a fundamentally nondeterministic evolution, a sufficient condition of globa...

متن کامل

Zonal flows and pattern formation

The general aspects of zonal flow physics, their formation, damping and interplay with quasi two dimensional turbulence are explained in the context of magnetized plasmas and quasi-geostrophic fluids with an emphasis on formation and selection of spatial patterns. General features of zonal flows as they appear in planetary atmospheres, rotating convection experiments and fusion plasmas are revi...

متن کامل

Optimal Evacuation Flows on Dynamic Paths with General Edge Capacities

A Dynamic Graph Network is a graph in which each edge has an associated travel time and a capacity (width) that limits the number of items that can travel in parallel along that edge. Each vertex in this dynamic graph network begins with the number of items that must be evacuated into designated sink vertices. A k-sink evacuation protocol finds the location of k sinks and associated evacuation ...

متن کامل

Optimal pattern matching algorithms

We study a class of finite state machines, called w-matching machines, which yield to simulate the behavior of pattern matching algorithms while searching for a pattern w. They can be used to compute the asymptotic speed, i.e. the limit of the expected ratio of the number of text accesses to the length of the text, of algorithms while parsing an iid text to find the pattern w. Defining the orde...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Operations Research Society of Japan

سال: 1977

ISSN: 0453-4514,2188-8299

DOI: 10.15807/jorsj.20.77